On the Computational Complexity of Gossip Protocols
نویسندگان
چکیده
Gossip protocols deal with a group of communicating agents, each holding a private information, and aim at arriving at a situation in which all the agents know each other secrets. Distributed epistemic gossip protocols are particularly simple distributed programs that use formulas from an epistemic logic. Recently, the implementability of these distributed protocols was established (which means that the evaluation of these formulas is decidable), and the problems of their partial correctness and termination were shown to be decidable, but their exact computational complexity was left open. We show that for any monotonic type of calls the implementability of a distributed epistemic gossip protocol is a PNP ‖ complete problem, while the problems of its partial correctness and termination are in coNPNP.
منابع مشابه
Mean-field framework for performance evaluation of push-pull gossip protocols
Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial view of the global system. Because of the size of these networks, analysis of gossip protocols is mostly done using simulations, but even they tend to be expensive in computation time and memory consumption. We employ m...
متن کاملHow Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call model (introduced by Karp et al. [1]), and we analyze two different notions of robustness: the ability to tolerate adaptive failures, and the abi...
متن کاملBridging the Gap between Population and Gossip-based Protocols
Gossip-based protocols are simple, robust and scalable and have been consistently applied in many distributed, mostly wired, settings. Most validation in this area has been so far empirical and there is a clear lack of a theoretical counterpart clearly defining what can and cannot be computed with gossip-based protocols. Population protocols, on the other hand, provide a clear and formal model ...
متن کاملLocality-Based Aggregate Computation in Wireless Sensor Networks
The design of efficient gossip-based protocols for computing aggregate functions in wireless sensor network has received considerable attention recently. A primary reason for this surge in interest is their robustness due to their randomized nature. In addition, because of the inherent simplicity in their design, gossip-based protocols are suitable to be implemented on sensor nodes with limited...
متن کاملMiCA: A Compositional Architecture for Gossip Protocols
C o n si st en t * lete * W ll D o c u m e n t e d * E a s y t o R e u s e * * E v a l u a t e d * E C O O P * Ar tifact * A E C The developers of today’s cloud computing systems are expected to not only create applications that will work well at scale, but also to create management services that will monitor run-time conditions and intervene to address problems as conditions evolve. Management...
متن کامل